Minimum-Distortion Embedding

نویسندگان

چکیده

We consider the vector embedding problem. are given a finite set of items, with goal assigning representative to each one, possibly under some constraints (such as collection vectors being standardized, i.e., have zero mean and unit covariance). data indicating that pairs items similar, optionally, other dissimilar. For similar we want corresponding be near other, for dissimilar pairs, not measured in Euclidean distance. formalize this by introducing distortion functions, defined items. Our is choose an minimizes total distortion, subject constraints. call minimum-distortion (MDE) The MDE framework simple but general. It includes wide variety methods, such spectral embedding, principal component analysis, multidimensional scaling, dimensionality reduction methods (like Isomap UMAP), force-directed layout, others. also new embeddings, provides principled ways validating historical embeddings alike. We develop projected quasi-Newton method approximately solves problems scales large sets. implement PyMDE, open-source Python package. In users can select from library functions or specify custom ones, making it easy rapidly experiment different embeddings. software sets millions tens functions. To demonstrate our method, compute several real-world sets, including images, academic co-author network, US county demographic data, single-cell mRNA transcriptomes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Exact Algorithm for Minimum Distortion Embedding

Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5. This is the first algorithm breaking the trivial n!-barrier.

متن کامل

Rate-Distortion Optimized Embedding

In this paper, we improve the performance of the embedded coder by reorganising its output bitstream in the rate-distortion (R-D) sense. In the proposed rate-distortion optimized embedding (RDE), the coding bit is first allocated to the coefficient with the steepest R-D slope, i.e. the biggest distortion decrease per coding bit. To avoid transmission of the position of the coded coefficient, RD...

متن کامل

Quantizing for minimum distortion

tions for the maximum likelihood estimate of the random function, W(t), which was previously obtained by Youla follows.” There also results another system of equations determining that estimate of the random function W(t) which is equivalent to Youla’s system of equations. The general method discussed in the preceding section also yields the solution of many other problems of optimum system the...

متن کامل

Minimum Volume Embedding

Minimum Volume Embedding (MVE) is an algorithm for non-linear dimensionality reduction that uses semidefinite programming (SDP) and matrix factorization to find a low-dimensional embedding that preserves local distances between points while representing the dataset in many fewer dimensions. MVE follows an approach similar to algorithms such as Semidefinite Embedding (SDE), in that it learns a k...

متن کامل

Minimum Depth Graph Embedding

The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has important practical applications to graph drawing. We give a linear time algorithm for computing a minimum depth embedding of a planar graphs whose biconnected components have a prescribed embedding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations and trends in machine learning

سال: 2021

ISSN: ['1935-8245', '1935-8237']

DOI: https://doi.org/10.1561/2200000090